Java-Based Coupling for Parallel Predictive-Adaptive Domain Decomposition

Java-based coupling for parallel predictive-adaptive domain decomposition

Parallel Domain Decomposition Solver for Adaptive Hp Finite Element Methods

In this paper, the development and implementation of highly parallelizable domain decomposition solvers for adaptive hp finite element methods is discussed. Two-level orthogonalization is used to obtain a reduced system which is preconditioned by a coarse grid operator. The condition number of the preconditioned system, for Poisson problems in two space dimensions, is proved to be bounded by C(...

A Domain Decomposition for a Parallel Adaptive Meshing Algorithm

We describe a domain decomposition algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst. Our algorithm has low communication , makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure. In [4, 5], we introduced a gene...

A Domain Decomposition Solver for a Parallel Adaptive Meshing Paradigm

We describe a domain decomposition (DD) algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst [3, 4]. Our algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure.

Coupling parallel adaptive mesh refinement with a nonoverlapping domain decomposition solver

We study the effect of adaptive mesh refinement on a parallel domain decomposition solver of a linear system of algebraic equations. These concepts need to be combined within a parallel adaptive finite element software. A prototype implementation is presented for this purpose. It uses adaptive mesh refinement with one level of hanging nodes. Two and three-level versions of the Balancing Domain ...